Filtered overlap: speedup, locality, kernel non-normality andZAsimeq 1
نویسندگان
چکیده
منابع مشابه
ar X iv : h ep - l at / 0 50 60 27 v 1 2 8 Ju n 20 05 Filtered overlap : speedup , locality , kernel non - normality and Z A ≃ 1
We investigate the overlap operator with a UV filtered Wilson kernel. The filtering leads to a better localization of the operator even on coarse lattices and with the untuned choice ρ=1. Furthermore, the axial-vector renormalization constant ZA is much closer to 1, reducing the mismatch with perturbation theory. We show that all these features persist over a wide range of couplings and that th...
متن کاملUV-filtered overlap fermions
We discuss the kernel spectrum, locality properties and the axial-vector renormalization constant of UV-filtered overlap fermions. We find that UV-filtered overlap fermions have a better conditioned kernel, better locality and an axial-vector renormalization constant closer to 1 than their unfiltered counterparts, even if the shift parameter ρ is simply set to 1.
متن کاملFiltered Kernel Density Estimation
A modification of the kernel estimator for density estimation is proposed which allows the incorporation of local information about the smoothness of the density. The estimator uses a small set of bandwidths rather than a single global one as in the standard kernel estimator. It uses a set of filtering functions which determine the extent of influence of the individual bandwidths. Various versi...
متن کاملSpeedup of kernel eigenvoice speaker adaptation by embedded kernel PCA
Recently, we proposed an improvement to the eigenvoice (EV) speaker adaptation called kernel eigenvoice (KEV) speaker adaptation. In KEV adaptation, eigenvoices are computed using kernel PCA, and a new speaker’s adapted model is implicitly computed in the kernel-induced feature space. Due to many online kernel evaluations, both adaptation and subsequent recognition of KEV adaptation are slower ...
متن کاملOn the kernel Extreme Learning Machine speedup
In this paper, we describe an approximate method for reducing the time and memory complexities of the kernel Extreme Learning Machine variants. We show that, by adopting a Nyström-based kernel ELM matrix approximation, we can define an ELM space exploiting properties of the kernel ELM space that can be subsequently used to apply several optimization schemes proposed in the literature for ELM ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2005
ISSN: 1029-8479
DOI: 10.1088/1126-6708/2005/09/030